Efficient Solid Waste Management in Prai Industrial Area through GIS using Dijkstra and Travelling Salesman Problem Algorithms
نویسندگان
چکیده
The fourth industrial revolution (IR 4.0) supports new solid waste management and effective routing system for collection transport of wastes, especially in achieving Penang 2030 vision to become a pollution free smart city. This study will enhance Seberang Perai Municipal Council (MBSP) Prai area by implementing Dijkstra Travelling Salesman Problem (TSP) algorithms using Geographic Information System version 10.1. route optimization involved 24 companies Phase I, II, IV area. authority is currently only one transfer the waste-to-waste station. algorithm can optimize alternative 1 distance 19.74% whereby 2 ended up with extra 3.73% compared existing single used MBSP. forward involves direction cleaning depot (source) as starting point station (destination) ending point. TSP having advantage return route. evaluated through gave shorter 6.61% Alternative potential save fuel cost 19.75%. Existing carries 9.2% per year transportation carbon emission level. assessed reported lower level at 7.4% 8.6% year, respectively. Findings this help improving MBSP’s realize vision.
منابع مشابه
Municipal Solid Waste Management using GIS Application in Mirpur Area of Dhaka City, Bangladesh
Identifying Municipal Solid Waste (MSW) disposal sites and appropriately managing them is a challenging task to many developing countries like Bangladesh. It is a complex issue in an urban area, as increasing population levels, rapid economic growth and rise in community living standard, accelerates the generation rate of MSW. The study area is zone-2 (Mirpur-Pallabi) of Dhaka North City Corpor...
متن کاملMunicipal Solid Waste Management using GIS Application in Mirpur Area of Dhaka City, Bangladesh
Identifying Municipal Solid Waste (MSW) disposal sites and appropriately managing them is a challenging task to many developing countries like Bangladesh. It is a complex issue in an urban area, as increasing population levels, rapid economic growth and rise in community living standard, accelerates the generation rate of MSW. The study area is zone-2 (Mirpur-Pallabi) of Dhaka North City Corpor...
متن کاملApproaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms
Genetic algorithms (GAs) were developed as problem independent search algorithms (Goldberg, 1989; Holland, 1975; Man et al., 1999), which simulate the biological evolution to search for an optimal solution to a problem. Figure 1(a) shows the main processes of genetic algorithms. When developing a genetic algorithm, we analyze the properties of the problem and determine the “gene encoding” polic...
متن کاملComparative Analysis of Various Algorithms Used in Travelling Salesman Problem
The Travelling Salesman Problem is a well known problem which has becomea comparison benchmark test for different computational methods. Its solution is computationally difficult, although the problem is easily expressed. TSP is one of the most famous combinatorial optimization (CO) problems and which has wide application background. The aim of our work is to compare existing algorithms that ar...
متن کاملExploration of Genetic Parameters and Operators through Travelling Salesman Problem
In this paper, we describe the use of advanced statistical design in the screening experiment to configure parameters and operators of genetic algorithm (GA), which applied to find a shortest distance in a classical travelling salesman problem (TSP). Due to the number of GA parameters, operators and its levels considered in the experiment, the total numbers of program executions required by the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: pertanika journal of science and technology
سال: 2021
ISSN: ['0128-7680', '2231-8526']
DOI: https://doi.org/10.47836/pjst.29.3.02